Computational complexity - PDFSEARCH.IO - Document Search Engine

Computational complexity
Results: 2253

#	Item
671	On the Complexity of Immersed Normal Surfaces Benjamin A. Burton∗ ´ Eric Colin de Verdi`ere† Add to Reading List Source URL: www.di.ens.fr Language: English - Date: 2014-02-07 07:27:37 Geometric topology Surfaces Differential topology 3-manifolds Manifold Computational topology Triangulation Normal surface Boolean satisfiability problem Topology Geometry Mathematics
672	Weak Formal Systems and Connections to Computational Complexity Lecture Notes for a Topics Course University of California, Berkeley January-May 1988 Add to Reading List Source URL: euclid.ucsd.edu Language: English - Date: 2006-04-24 18:16:59 Proof theory Automated theorem proving Propositional calculus Logical truth Logical syntax Sequent Cut-elimination theorem Substitution Resolution Logic Mathematical logic Mathematics
673	Scheduling and SAT Emmanuel Hebrard Toulouse Outline Add to Reading List Source URL: homepages.laas.fr Language: English - Date: 2014-02-17 02:59:42 Constraint programming Logic in computer science NP-complete problems Boolean algebra Boolean satisfiability problem Electronic design automation Satisfiability NP-complete Model checking Theoretical computer science Applied mathematics Computational complexity theory
674	Research internship (Master M2) Title Verification of Distributed Systems with Parameterized Network Topology Description Add to Reading List Source URL: www.lsv.ens-cachan.fr Language: English - Date: 2014-10-08 10:04:52 Computational complexity theory Automata theory Symposium on Theoretical Aspects of Computer Science Cryptographic protocols Model checking Network topology
675	A faster parameterized algorithm for set packing Ioannis Koutis Computer Science Department Carnegie Mellon University Pittsburgh, PAUSA Add to Reading List Source URL: ccom.uprrp.edu Language: English - Date: 2011-03-02 23:58:37 NP-complete problems Combinatorics Analysis of algorithms Set packing Randomized algorithm Disjoint-set data structure Parameterized complexity Set cover problem Dominating set Theoretical computer science Computational complexity theory Mathematics
676	Journal of Computer and System Sciences–737 Contents lists available at ScienceDirect Journal of Computer and System Sciences www.elsevier.com/locate/jcss Add to Reading List Source URL: math.mit.edu Language: English - Date: 2011-03-23 10:26:18 Applied mathematics Natural proof Pseudorandom generator Entailment Time complexity Circuit complexity Arithmetic function Holomorphic functional calculus Theoretical computer science Computational complexity theory Logic
677	CCCG 2014, Halifax, Nova Scotia, August 11–13, 2014 Covering Orthogonal Polygons with Sliding k-transmitters Salma Sadat Mahdavi∗ Saeed Seddighin Add to Reading List Source URL: www.cccg.ca Language: English - Date: 2014-08-05 11:21:00 Complexity classes Polygons Structural complexity theory Mathematical optimization Art gallery problem Approximation algorithm Reduction NP-complete Optimization problem Theoretical computer science Computational complexity theory Applied mathematics
678	Distributed Computing FS 2011 Prof. R. Wattenhofer Barbara Keller Add to Reading List Source URL: dcg.ethz.ch Language: English - Date: 2014-09-26 08:28:47 Spanning tree Fault-tolerant computer systems Analysis of algorithms Self-stabilization Minimum spanning tree Algorithm Time complexity Bellman–Ford algorithm Distributed computing Theoretical computer science Computational complexity theory Mathematics
679	ICS 260 – Fall 2001 – Final Exam Name: Answer Key Student ID: 1: Add to Reading List Source URL: www.ics.uci.edu Language: English - Date: 2001-12-12 17:36:39 NP-complete problems Travelling salesman problem Independent set NP-complete Set cover problem NP Directed acyclic graph Kernelization Vertex cover Theoretical computer science Computational complexity theory Mathematics
680	CCCG 2013, Waterloo, Ontario, August 8–10, 2013 Stabbing Polygonal Chains with Rays is Hard to Approximate Steven Chaplick∗ Elad Cohen† Add to Reading List Source URL: www.cccg.ca Language: English - Date: 2013-08-11 21:51:57 NP-complete problems Vertex cover Reduction Ordinal number Parameterized complexity Cardinality APX Set cover problem Polygonal chain Theoretical computer science Computational complexity theory Mathematics

UPDATE